Reducing the Computational Time for the Kemeny Method by Exploiting Condorcet Properties

Preference aggregation and in particular ranking are mainly studied by the field of social choice theory but extensively applied a variety contexts. Among most prominent methods for aggregation, Kemeny method has been proved to be only one that satisfies some desirable properties such as neutrality, consistency Condorcet condition at same time. Unfortunately, problem finding is NP-hard, which prevents practitioners from using it real-life problems. The state art exact algorithms computation experienced major boost last year with presentation an algorithm provides searching time guarantee up 13 alternatives. In this work, we propose enhanced version based on pruning search space when hold. This greatly improves performance terms runtime consumption.